A Clustering Based Niching Method for Evolutionary Algorithms
نویسندگان
چکیده
We propose the Clustering Based Niching (CBN) method for Evolutionary Algorithms (EA) to identify multiple global and local optima in a multimodal search space. The basic idea is to apply the biological concept of species in separate ecological niches to EA to preserve diversity. We model species using a multipopulation approach, one population for each species. To identify species in a EA population we apply a clustering algorithm based on the most suitable individual geno-/phenotype representation. One of our goals is to make the niching method as independent of the underlying EA method as possible in such a way that it can be applied to multiple EA methods and that the impact of the niching method on the EA mechanism is as small as possible. CBN starts with a single primordial unclustered population P0. Then the CBNEA generational cycle is entered. First for each population Pi one complete EA generation of evaluation, selection and reproduction is simulated. Now CBN starts with the differentiation of the populations by calling the clustering algorithm on each Pi. If multiple clusters are found in Pi, it splits into multiple new populations. All individuals of Pi not included in the clusters found are moved to P0 as straying loners. To prevent multiple populations to explore the same niche CBN uses representatives (e.g. a centroid) of all populations Pi>0 to determine if populations are to be merged. To stabilize the results of the clustering algorithm we currently reduce the mutation step size within all clustered populations Pi>0. A detailed description of the CBN model can be found in [2]. Of course the performance of CBN depends on the clustering algorithm used, since this algorithm specifies the number and kind of niches that can be distinguished. We decided to use the density-based clustering [1] which can identify an a priori unknown number of niches of arbitrary size, shape and spacing. This multi-population approach of CBN replaces the global selection of a standard EA with localized niche based selection and mating. This ensures the survival of each identified niche if necessary. Also each converged population Pi>0 directly designates a local/global optimum.
منابع مشابه
Proposing a Novel Cost Sensitive Imbalanced Classification Method based on Hybrid of New Fuzzy Cost Assigning Approaches, Fuzzy Clustering and Evolutionary Algorithms
In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...
متن کاملGenetic Algorithms, Clustering, and the Breaking of Symmetry Genetic Algorithms, Clustering, and the Breaking of Symmetry
This paper introduces clustering as a tool to improve the eeects of recombination and incorporate niching in evolutionary algorithms. Instead of processing the entire set of parent solutions, the set is rst clustered and the solutions in each of the clusters are processed separately. This alleviates the problem of symmetry which is often a major diiculty of many evolutionary algorithms in combi...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملGenetic Algorithms, Clustering, and the Breaking of Symmetry
This paper introduces clustering as a tool to improve the e ects of recombination and in corporate niching in evolutionary algorithms Instead of processing the entire set of parent solutions the set is rst clustered and the solutions in each of the clusters are processed sep arately This alleviates the problem of symmetry which is often a major di culty of many evolutionary algorithms in combin...
متن کاملA Clustering Based Niching EA for Multimodal Search Spaces
We propose a new niching method for Evolutionary Algorithms which is able to identify and track global and local optima in a multimodal search space. To prevent the loss of diversity we replace the global selection pressure within a single population by local selection of a multi-population strategy. The sub-populations representing species specialized on niches are dynamically identified using...
متن کاملخوشهبندی خودکار دادهها با بهرهگیری از الگوریتم رقابت استعماری بهبودیافته
Imperialist Competitive Algorithm (ICA) is considered as a prime meta-heuristic algorithm to find the general optimal solution in optimization problems. This paper presents a use of ICA for automatic clustering of huge unlabeled data sets. By using proper structure for each of the chromosomes and the ICA, at run time, the suggested method (ACICA) finds the optimum number of clusters while optim...
متن کامل